Search Strategy Simulation in Constraint Booleanization
نویسنده
چکیده
Within the recently proposed Universal Booleanization framework, we consider the CUMULATIVE constraint, for which the original Boolean encoding proves ineffective, and present a new Boolean encoding that causes the SAT solver to simulate, largely, the search strategy used by some of the best-performing native methods. Apart from providing motivation for future research in a similar direction, we obtain a significantly enhanced version of Universal Booleanization for problems containing CUMULATIVE constraints.
منابع مشابه
Universal Booleanization of Constraint Models
While the efficiency and scalability of modern SAT technology offers an intriguing alternative approach to constraint solving via translation to SAT, previous work has mostly focused on the translation of specific types of constraints, such as pseudo Boolean constraints, finite integer linear constraints, and constraints given as explicit listings of allowed tuples. By contrast, we present a tr...
متن کاملAccurate Booleanization of Continuous Dynamics for Analog/Mixed-Signal Design
Accurate Booleanization of Continuous Dynamics for Analog/Mixed-Signal Design
متن کاملScheduling Single-Load and Multi-Load AGVs in Container Terminals
In this paper, three solutions for scheduling problem of the Single-Load and Multi-Load Automated Guided Vehicles (AGVs) in Container Terminals are proposed. The problem is formulated as Constraint Satisfaction and Optimization. When capacity of the vehicles is one container, the problem is a minimum cost flow model. This model is solved by the highest performance Algorithm, i.e. Network Simple...
متن کاملImpact-Based Search in Constraint-based Scheduling
A novel adaptation of impact-based search strategies for constraint-based resource scheduling is presented. Search based on impacts applies a general purpose search strategy originally from Linear Integer Programming and recently adapted to Constraint Programming. To my knowledge it is shown for the first time that this strategy is properly applicable to constraint-based scheduling and performs...
متن کاملDynamic Constraint Weighting for
Many real-world constraint satisfaction problems (CSPs) can be over-constrained but contain a set of mandatory or hard constraints that have to be satisfied for a solution to be acceptable. Recent research has shown that constraint weighting local search algorithms can be very effective in solving a variety of CSPs. However, little work has been done in applying such algorithms to over-constrai...
متن کامل